RAPPORT Completing partial combinatory algebras with unique head - normal forms
نویسندگان
چکیده
In this note, we prove that having unique head-normal forms is a suucient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.
منابع مشابه
Completing Partial Combinatory Algebras With Unique Head-Normal Forms
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application, we show that the pca of strongly normalizing CL-terms as well as the pca of natural numbers with partial recursive function application can be extended to total combinatory algebras.
متن کاملPartial Combinatory Algebras of Functions
We employ the notions of ‘sequential function’ and ‘interrogation’ (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley’s preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results i...
متن کاملA Note on Absolutely Unorderable Combinatory Algebras
Plotkin [16] has conjectured that there exists an absolutely unorderable combinatory algebra, namely a combinatory algebra which cannot be embedded in another combinatory algebra admitting a non-trivial compatible partial order. In this paper we prove that a wide class of combinatory algebras admits extensions with a non-trivial compatible partial order.
متن کاملFormal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
We prove the correctness of an algorithm for normalizing untyped combinator terms by evaluation. The algorithm is written in the functional programming language Haskell, and we prove that it lazily computes the combinatory Böhm tree of the term. The notion of combinatory Böhm tree is analogous to the usual notion of Böhm tree for the untyped lambda calculus. It is defined operationally by repea...
متن کاملSN Combinators and Partial Combinatory Algebras
We introduce an intersection typing system for combinatory logic, such that a term of combinatory logic is typeable ii it is sn. We then prove the soundness and completeness for the class of partial com-binatory algebras. Let F be the class of non-empty lters which consist of types. Then F is an extensional non-total partial combinatory algebra. Furthermore, it validates the strongest consisten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995